The Combination Theorem and Quasiconvexity

We show that if G is a fundamental group of a finite k-acylindrical graph of groups where every vertex group is word-hyperbolic and where every edge-monomorphism is a quasi-isometric embedding, then all the vertex groups are quasiconvex in G (the group G is word-hyperbolic by the Combination Theorem of M.Bestvina and M.Feighn). This allows one, in particular, to approximate the word metric on G by normal forms for this graph of groups.